Mechanism design for set cover games with selfish element agents

In this paper we study the set cover games when the elements are selfish agents, each of which has a privately known valuation of receiving the service from the sets, i.e., being covered by some set. Each set is assumed to have a fixed cost. We develop several approximately efficient strategyproof mechanisms that decide, after soliciting the declared bids by all elements, which elements will be covered, which sets will provide the coverage to these selected elements, and how much each element will be charged. For single-cover set cover games, we present a mechanism that is at least 1 dmax -efficient, i.e., the total valuation of all selected elements is at least 1 dmax fraction of the total valuation produced by any mechanism. Here dmax is the maximum size of the sets. For multi-cover set cover games, we present a budget-balanced strategyproof mechanism